On classifying Minkowskian sublattices
نویسندگان
چکیده
منابع مشابه
On classifying Minkowskian sublattices
Let Λ be a lattice in an n-dimensional Euclidean space E and let Λ′ be a Minkowskian sublattice of Λ, that is, a sublattice having a basis made of representatives for the Minkowski successive minima of Λ. We extend the classification of possible Z/dZ-codes of the quotients Λ/Λ′ to dimension 9, where dZ is the annihilator of Λ/Λ′.
متن کاملar X iv : 0 90 4 . 31 10 v 2 [ m at h . N T ] 3 1 Ju l 2 01 0 ON CLASSIFYING MINKOWSKIAN SUBLATTICES
Let Λ be a lattice in an n-dimensional Euclidean space E and let Λ be a Minkowskian sublattice of Λ, that is, a sublattice having a basis made of representatives for the Minkowski successive minima of Λ. We extend the classification of possible Z/dZ-codes of the quotients Λ/Λ to dimension 9, where dZ is the annihilator of Λ/Λ.
متن کاملOn Minkowskian Branching Structures
Contrary to its initial idea, Belnap’s (1992) theory of Branching Space-Times (BST) has models in which histories do not resemble relativistic space-times or any other physical space-times. The aim of this paper is to define a certain class of BST models, called ”Minkowskian Branching Structures” (MBS), in which histories are isomorphic to Minkowski space-time. By focusing on these models rathe...
متن کاملMaximal Sublattices and Frattini Sublattices of Bounded Lattices
We will address these questions in order, and provide good partial answers, especially for nite lattices which are bounded homomorphic images of a free lattice. Recall that a nite lattice is bounded if and only if it can be obtained from the one element lattice by a sequence of applications of Alan Day's doubling construction for intervals. In particular, nite distributive lattices are bounded....
متن کاملOn Distribution of Well - Rounded Sublattices
A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of Z 2 , as well as their determinant and minima sets. We show that the determinant set has positive density, deriving an explicit lower bound for it, while the minima set has density 0. We also produce formulas for the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2011
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2011-02528-7